Tutte Polynomial, Complete Invariant, and Theta Series
نویسندگان
چکیده
منابع مشابه
Series-parallel posets and the Tutte polynomial
We investigate the Tutte polynomial f(P; t, z) of a series-parallel partially ordered set P. We show that f(P) can be computed in polynomial-time when P is series-parallel and that series-parallel posets having isomorphic deletions and contractions are themselves isomorphic. A formula forf’(P*) in terms off(P) is obtained and shows these two polynomials factor over Z[t, z] the same way. We exam...
متن کاملSeries and parallel reductions for the Tutte polynomial
We discuss reducing the number of steps involved in computing the Tutte polynomial of a matroid by using series and parallel reductions in conjunction with the usual deletion and contraction operations. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملThe Tutte polynomial
This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–...
متن کاملFourientations and the Tutte polynomial
for α, γ ∈ {0, 1, 2} and β , δ ∈ {0, 1}. We introduce an intersection lattice of 64 cut–cycle fourientation classes enumerated by generalized Tutte polynomial evaluations of this form. We prove these enumerations using a single deletion–contraction argument and classify axiomatically the set of fourientation classes to which our deletion–contraction argument applies. This work unifies and exten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2020
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-020-02238-w